Dialectical Explanations in Defeasible Argumentation
نویسندگان
چکیده
This work addresses the problem of providing explanation capabilities to an argumentation system. Explanation in defeasible argumentation is an important, and yet undeveloped field in the area. Therefore, we move in this direction by defining a concrete argument system with explanation facilities. We consider the structures that provide information on the warrant status of a literal. Our focus is put on argumentation systems based on a dialectical proof procedure, therefore we study dialectical explanations. Although arguments represent a form of explanation for a literal, we study the complete set of dialectical trees that justifies the warrant status of a literal, since this set has proved to be a useful tool to comprehend, analyze, develop, and debug argumentation systems.
منابع مشابه
On the existence and multiplicity of extensions in dialectical argumentation
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of extensions in terms of the notion of dialectical justification, a close cousin of the notion of admissibility. The characterization is given in the context of the ...
متن کاملDialectical Proof Theory for Defeasible Argumentation with Defeasible Priorities (Preliminary Report)
In this paper a dialectical proof theory is proposed for logical systems for defeasible argumentation that t a certain format. This format is the abstract theory developed by Dung, Kowalski and others. A main feature of the proof theory is that it also applies to systems in which reasoning about the standards for comparing arguments is possible. The proof theory could serve as thèlogical core' ...
متن کاملA Framework for Multiagent Deliberation Based on Dialectical Argumentation
Simply put, a multiagent system can be seen as a collection of autonomous agents that as a whole are able to accomplish goals beyond the reach of any of its members. Agent interaction is widely acknowledged as the feature that provides this added potential. Since many, if not all, of the attractive agent interactions can be recasted as deliberations, a formalization for this process is being ac...
متن کاملComputing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty and fuzzy knowledge at object-language level. Solving a P-DeLP query Q accounts for performing an exhaustive analysis of arguments and defeaters for Q, resulting in a so-calle...
متن کاملIntroducing Dialectical Bases in Defeasible Argumentation
Defeasible argumentation is a form of defeasible reasoning, that emphasizes the notion of an argument. An argument A for a conclusion q is a tentative piece of reasoning which supports q. In an argumentative framework, common sense reasoning can be modeled as a process in which we must determine whether an argument justifies its conclusion. The process mentioned above takes considerable computa...
متن کامل